Generating minimally transitive permutation groups

Generating Transitive Permutation Groups

On solvable minimally transitive permutation groups

We investigate properties of finite transitive permutation groups (G, Ω) in which all proper subgroups of G act intransitively on Ω. In particular, we are interested in reduction theorems for minimally transitive representations of solvable groups.

On Transitive Permutation Groups

We assign names and new generators to the transitive groups of degree up to 15, reflecting their structure.

Constructing transitive permutation groups

This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30.

Abstract Groups as Doubly Transitive Permutation Groups *

Groups as Doubly Transitive Permutation Groups *